Maintaining dynamic graph properties deterministically
نویسنده
چکیده
In this paper we present deterministic fully dynamic algorithms for maintaining several properties on undirected graphs subject to edge insertions and deletions, in polylogarithmic time per operation. Combining techniques from [6, 10], we can maintain a minimum spanning forest of a graph with k different edge weights in O(k log n) amortized time per update; maintain an 1+ -approximation of the minimum spanning forest in O(log n log(U(1 + ))/ log(1 + )) amortized time per update, where edge weights are between 1 and U ; test if a graph is bipartite in O(1) worst-case time, supporting updates in O(log n) amortized time; test if the removal of k given edges disconnect the graph (k-edge witness problem) in O(k log n) amortized time, supporting updates in O(log n) amortized time; maintain a maximal spanning forest decomposition of order k in O(k log n) amortized time per update. For all these problems, our algorithms match the previous best randomized bounds, and improve substantially over the best deterministic bounds.
منابع مشابه
Maintaining alterable planar embeddings of dynamic graphs
We present a data structure for maintaining a planar embedding of a dynamic plane graph. The graph may be updated with edge deletions and insertions of edges when it does not violate the embedding. Queries of vertex pairs return the list of possible places for inserting an edge. Furthermore, the embedding may be updated with flips that alter the embedding by swapping the orientation of a subgra...
متن کاملFully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
Despite significant research effort, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial worst-case update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estima...
متن کاملSeparator Based Sparsification. I. Planary Testing and Minimum Spanning Trees
We describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We give a fully dynamic planarity testing algorithm that maintains a graph subject to edge insertions and deletions and that allows queries that test whether the graph is currently planar, or whether a potentia...
متن کاملA mechanically proved and incremental development of IEEE 1394
The IEEE 1394 tree identify protocol illustrates the adequacy of the event-driven approach used together with the B Method . This approach provides a complete framework for developing mathematical models of distributed algorithms. A speci c development is made of a series of more and more re ned models. Each model is made of a number of static properties (the invariant), and of a dynamic parts ...
متن کاملSeparator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe algorithms and data structures for maintaining information about 2and 3-vertex-connectivity, and 3and 4-edge-connectivity in a planar graph in O(n1/2) amortized time per insertion, deletion, or connectivity query. All ...
متن کامل